翻訳と辞書 |
Bidirectional map : ウィキペディア英語版 | Bidirectional map
In computer science, a bidirectional map, or hash bag, is an associative data structure in which the pairs form a one-to-one correspondence. Thus the binary relation is functional in each direction: can also act as a key to . A pair thus provides a unique coupling between and so that can be found when is used as a key and can be found when is used as a key. ==External links==
* (Boost.org ) * (Commons.apache.org ) * (Cablemodem.fibertel.com.ar ) * (Codeproject.com ) * (Guava-libraries.googlecode.com )
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Bidirectional map」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|